1070D - Garbage Disposal - CodeForces Solution


greedy *1300

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
long long n,k,x,yu,z,cnt;
int main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>x;
        if(yu>0) x=x-k+yu,cnt++;
        z=x/k;cnt+=z;
        yu=x%k;
    }
    if(yu>0)cnt++;
    cout<<cnt;
}

   	 	    	     	  		   	  	 	


Comments

Submit
0 Comments
More Questions

298B - Sail
239A - Two Bags of Potatoes
1704E - Count Seconds
682A - Alyona and Numbers
44A - Indian Summer
1133C - Balanced Team
1704A - Two 0-1 Sequences
1467A - Wizard of Orz
1714E - Add Modulo 10
1714A - Everyone Loves to Sleep
764A - Taymyr is calling you
1714B - Remove Prefix
1264F - Beautiful Fibonacci Problem
52A - 123-sequence
1543A - Exciting Bets
1714D - Color with Occurrences
215B - Olympic Medal
1445A - Array Rearrangment
1351A - A+B (Trial Problem)
935B - Fafa and the Gates
1291A - Even But Not Even
1269A - Equation
441A - Valera and Antique Items
1702C - Train and Queries
816B - Karen and Coffee
838D - Airplane Arrangements
148B - Escape
847G - University Classes
1110A - Parity
1215B - The Number of Products